Witness Runs for Counter Machines
Identifieur interne : 001448 ( Main/Exploration ); précédent : 001447; suivant : 001449Witness Runs for Counter Machines
Auteurs : Clark Barrett [États-Unis] ; Stéphane Demri [États-Unis, France] ; Morgan Deters [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In this paper, we present recent results about the verification of counter machines by using decision procedures for Presburger arithmetic. We recall several known classes of counter machines for which the reachability sets are Presburger-definable as well as temporal logics with arithmetical constraints. We discuss issues related to flat counter machines, path schema enumeration, and the use of SMT solvers.
Url:
- https://api.istex.fr/ark:/67375/HCB-SRLX5BMH-Z/fulltext.pdf
- https://api.istex.fr/ark:/67375/HCB-JN2ZK1DS-D/fulltext.pdf
DOI: 10.1007/978-3-642-40885-4_9
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001612
- to stream Istex, to step Curation: 001593
- to stream Istex, to step Checkpoint: 000074
- to stream Main, to step Merge: 001460
- to stream Istex, to step Corpus: 002555
- to stream Istex, to step Curation: 002524
- to stream Istex, to step Checkpoint: 000073
- to stream Main, to step Merge: 001459
- to stream Main, to step Curation: 001448
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Witness Runs for Counter Machines</title><author><name sortKey="Barrett, Clark" sort="Barrett, Clark" uniqKey="Barrett C" first="Clark" last="Barrett">Clark Barrett</name></author><author><name sortKey="Demri, Stephane" sort="Demri, Stephane" uniqKey="Demri S" first="Stéphane" last="Demri">Stéphane Demri</name></author><author><name sortKey="Deters, Morgan" sort="Deters, Morgan" uniqKey="Deters M" first="Morgan" last="Deters">Morgan Deters</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5F2853E27B82825136127F0A82CF17C88E46334D</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40885-4_9</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-SRLX5BMH-Z/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001612</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001612</idno><idno type="wicri:Area/Istex/Curation">001593</idno><idno type="wicri:Area/Istex/Checkpoint">000074</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000074</idno><idno type="wicri:doubleKey">0302-9743:2013:Barrett C:witness:runs:for</idno><idno type="wicri:Area/Main/Merge">001460</idno><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:9FB864327A78B828D30990CC3F3FE075DD777B82</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-JN2ZK1DS-D/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002555</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002555</idno><idno type="wicri:Area/Istex/Curation">002524</idno><idno type="wicri:Area/Istex/Checkpoint">000073</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000073</idno><idno type="wicri:doubleKey">0302-9743:2013:Barrett C:witness:runs:for</idno><idno type="wicri:Area/Main/Merge">001459</idno><idno type="wicri:Area/Main/Curation">001448</idno><idno type="wicri:Area/Main/Exploration">001448</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Witness Runs for Counter Machines</title><author><name sortKey="Barrett, Clark" sort="Barrett, Clark" uniqKey="Barrett C" first="Clark" last="Barrett">Clark Barrett</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>New York University</wicri:regionArea></affiliation></author><author><name sortKey="Demri, Stephane" sort="Demri, Stephane" uniqKey="Demri S" first="Stéphane" last="Demri">Stéphane Demri</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>New York University</wicri:regionArea></affiliation><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>LSV, CNRS</wicri:regionArea><wicri:noRegion>CNRS</wicri:noRegion><wicri:noRegion>CNRS</wicri:noRegion></affiliation></author><author><name sortKey="Deters, Morgan" sort="Deters, Morgan" uniqKey="Deters M" first="Morgan" last="Deters">Morgan Deters</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>New York University</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper, we present recent results about the verification of counter machines by using decision procedures for Presburger arithmetic. We recall several known classes of counter machines for which the reachability sets are Presburger-definable as well as temporal logics with arithmetical constraints. We discuss issues related to flat counter machines, path schema enumeration, and the use of SMT solvers.</div></front></TEI><affiliations><list><country><li>France</li><li>États-Unis</li></country></list><tree><country name="États-Unis"><noRegion><name sortKey="Barrett, Clark" sort="Barrett, Clark" uniqKey="Barrett C" first="Clark" last="Barrett">Clark Barrett</name></noRegion><name sortKey="Demri, Stephane" sort="Demri, Stephane" uniqKey="Demri S" first="Stéphane" last="Demri">Stéphane Demri</name><name sortKey="Deters, Morgan" sort="Deters, Morgan" uniqKey="Deters M" first="Morgan" last="Deters">Morgan Deters</name></country><country name="France"><noRegion><name sortKey="Demri, Stephane" sort="Demri, Stephane" uniqKey="Demri S" first="Stéphane" last="Demri">Stéphane Demri</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001448 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001448 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:5F2853E27B82825136127F0A82CF17C88E46334D
|texte= Witness Runs for Counter Machines
}}
| This area was generated with Dilib version V0.6.33. |  |